On the Steady-State Solutions of Fixed-Interval and Fixed-Point Smoothers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the fixed point of order 2

This paper  deals with a new type  of fixed point, i.e;"fixed point of order 2" which is introduced in a metric spaceand some results are achieved.

متن کامل

Evolved digital ecosystems: Dynamic steady state, not optimal fixed point

Traditional models of ecosystems often assume that the species composing an unperturbed ecosystem become fixed so that only the relative abundances of the species change over time. Such ecosystems are said to have reached an optimal fixed point. However, recent work has suggested that neutral evolutionary processes can significantly alter the species composition of an ecosystem, allowing the ec...

متن کامل

On the steady-state mean squared error of the fixed-point LMS algorithm

This communication studies the quantization effects on the steady-state performance of a fixed-point implementation of the Least Mean Squares (LMS) adaptive algorithm. Based on experimental observations, we introduce a new intermediate mode of operation and develop a simplified theoretical approach to explain the behaviour caused by quantization effects in this mode. We also review the stall mo...

متن کامل

A strong convergence theorem for solutions of zero point problems and fixed point problems

Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated‎. ‎A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces‎.

متن کامل

Optimal Approximate Solutions of Fixed Point Equations

and Applied Analysis 3 Proof. As T and S form a K-Cyclic map, d x1, x2 d Tx0, Sx1 ≤ k d x0, Tx0 d x1, Sx1 1 − 2k d A,B k d x0, x1 d x1, x2 1 − 2k d A,B . 3.1 So, it follows that d x1, x2 ≤ k/ 1 − k d x0, x1 1 − k/ 1 − k d A,B . Similarly, it can be seen that d x2, x3 ≤ ( k 1 − k )2 d x0, x1 [ 1 − ( k 1 − k )2] d A,B . 3.2 Hence, it follows by induction that d xn, xn 1 ≤ ( k 1 − k )n d x0, x1 [ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers

سال: 1984

ISSN: 0453-4654

DOI: 10.9746/sicetr1965.20.1